import java.util.Arrays;

public class Sort {
    public static void main(String[] args) {
        int[] array = {27,15,9,28,18};
        //insertSort(array);
        shellSort(array);
        System.out.println(Arrays.toString(array));
    }
    public static void insertSort(int[] array){
        // write code  here
        for (int i = 1; i < array.length; i++) {
            int tmp = array[i];
            int j= i-1;
            for ( ; j >=0 ;j--) {
                if(array[j]>tmp){
                    array[j+1] = array[j];
                }
                else{
                    break;
                }
            }
            array[j+1] = tmp;
        }
    }


        // 希尔排序
    public static void shellSort(int[] array){
        // write code  here
        int gap = array.length;
        while(gap>1){
            gap /=2;
            shell(array,gap);
        }
    }
    public static void shell(int[] array,int gap) {
        for (int i = gap; i < array.length; i++) {
            int tmp = array[i];
            int j = i - gap;
            for (; j >= 0; j -= gap) {
                if (array[j ]> tmp){
                    array[j + gap] = array[j];
                }
                else{
                    break;
                }
            }
            array[j+gap] = tmp;
        }
    }
}
